Strong negations and restricted equivalence functions revisited: An analytical and topological approach
نویسندگان
چکیده
Throughout this paper, our main idea is to analyze the concepts of a strong negation and restricted equivalence function, that appear in natural way when dealing with theory applications fuzzy sets logic. Here we will use an analytical topological approach, showing how construct them easy way. In particular, also some classical functional equation related those key concepts.
منابع مشابه
Topological Quantum Field Theory and Strong Shift Equivalence
Given a TQFT in dimension d + 1, and an infinite cyclic covering of a closed (d + 1)-dimensional manifold M , we define an invariant taking values in a strong shift equivalence class of matrices. The notion of strong shift equivalence originated in R. Williams’ work in symbolic dynamics. The Turaev-Viro module associated to a TQFT and an infinite cyclic covering is then given by the Jordan form...
متن کاملStrong Topological Regularity and Weak Regularity of Banach Algebras
In this article we study two different generalizations of von Neumann regularity, namely strong topological regularity and weak regularity, in the Banach algebra context. We show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. Then we consider strong topological regularity of certain concrete algebras. Moreover we obtain ...
متن کاملsemi-analytical solution for static and forced vibration problems of laminated beams through smooth fundamental functions method
در این پایان نامه روش جدیدی مبتنی بر روش حل معادلات دیفرانسیل پارهای بر اساس روش توابع پایه برای حل مسایل ارتعاش اجباری واستاتیک تیرها و صفحات لایه ای ارایه شده است که می توان تفاوت این روش با روش های متداول توابع پایه را در استفاده از توابع هموار در ارضاء معادلات حاکم و شرایط مرزی دانست. در روش ارایه شده در این پایاننامه از معادله تعادل به عنوان معادله حاکم بر رفتار سیستم استفاده شده است که مو...
15 صفحه اولStrong Equivalence of Nonmonotonic Theories -- an Algebraic Approach
We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2021
ISSN: ['1872-6801', '0165-0114']
DOI: https://doi.org/10.1016/j.fss.2021.10.013